Heat kernel coupling for multiple graph analysis
نویسندگان
چکیده
In this paper, we introduce heat kernel coupling (HKC) as a method of constructing multimodal spectral geometry on weighted graphs of different size without vertex-wise bijective correspondence. We show that Laplacian averaging can be derived as a limit case of HKC, and demonstrate its applications on several problems from the manifold learning and pattern recognition domain.
منابع مشابه
Analysis of InGaAsP-InP Double Microring Resonator using Signal Flow Graph Method
The buried hetero-structure (BH) InGaAsP-InP waveguide is used for asystem of double microring resonators (DMR). The light transmission and location ofresonant peaks are determined for six different sets of ring radii with different ordermode numbers. The effect of changing middle coupling coefficient on the box likeresponse is studied. It is found that the surge of coupling coefficient to the ...
متن کاملHeat kernel analysis on graphs
In this thesis we aim to develop a framework for graph characterization by combining the methods from spectral graph theory and manifold learning theory. The algorithms are applied to graph clustering, graph matching and object recognition. Spectral graph theory has been widely applied in areas such as image recognition, image segmentation, motion tracking, image matching and etc. The heat kern...
متن کاملComputing Heat Kernel Pagerank and a Local Clustering Algorithm
Heat kernel pagerank is a variation of Personalized PageRank given in an exponential formulation. In this work, we present a sublinear time algorithm for approximating the heat kernel pagerank of a graph. The algorithm works by simulating random walks of bounded length and runs in time O( log( ) logn 3 log log( 1) ), assuming performing a random walk step and sampling from a distribution with b...
متن کاملThe heat kernel as the pagerank of a graph
The concept of pagerank was first started as a way for determining the ranking of Webpages by Web search engines. Based on relations in interconnected networks, pagerank has become a major tool for addressing fundamental problems arising in general graphs, especially for large information networks with hundreds of thousands of nodes. A notable notion of pagerank, introduced by Brin and Page and...
متن کاملTensor MRI Regularization via Graph Diffusion
A new method for diffusion tensor (DT) image regularization is presented that relies on heat diffusion on discrete structures. We represent a DT image using a weighted undirected graph, where the weights of the edges are determined from the geometry of the white matter fiber pathways. Diffusion across this weighted graph is captured by the heat equation, and the solution, i.e. the heat kernel, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1312.3035 شماره
صفحات -
تاریخ انتشار 2013